A Self-Bounding Branch \& Bound procedure for truck routing and scheduling

A modified branch and bound algorithm for a vague flow-shop scheduling problem

Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...

Branch-and-Price-and-Cut for the Vehicle Routing and Truck Driver Scheduling Problem

Many governments worldwide have imposed hours of service regulations for truck drivers to ensure that break and rest periods are regularly taken. Transport companies have to take these into account and plan the routes and schedules of their truck drivers simultaneously. This problem is called vehicle routing and truck driver scheduling problem (VRTDSP). With their paper “An exact method for veh...

Routing and Scheduling of Truck Traffic

An interval-matrix branch-and-bound algorithm for bounding eigenvalues

We present and explore the behaviour of a branch-and-bound algorithm for calculating valid bounds on the k-th largest eigenvalue of a symmetric interval matrix. Branching on the interval elements of the matrix takes place in conjunction with the application of Rohn’s method (an interval extension of Weyl’s theorem) in order to obtain valid outer bounds on the eigenvalues. Inner bounds are obtai...

A Branch-and-Bound Method for the Optimal Scheduling

This paper presents a new approach to the scheduling problem in high level synthesis. In this approach, iterative rescheduling processes are performed in a branch-andbound manner, starting with the as soon as possible scheduling result, so as to find the scheduling result of the lowest hardware cost under the given timing constraint. At each iteration step, only the candidate nodes are selected...